TSTP Solution File: SYN000^2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN000^2 : TPTP v8.1.2. Bugfixed v8.1.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 1 02:00:45 EDT 2023
% Result : Unknown 0.20s 0.72s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN000^2 : TPTP v8.1.2. Bugfixed v8.1.1.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat Aug 26 19:50:05 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.20/0.49 %----Proving TH0
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50 % File : SYN000^2 : TPTP v8.1.2. Bugfixed v8.1.1.
% 0.20/0.50 % Domain : Syntactic
% 0.20/0.50 % Problem : Advanced TPTP TH0 syntax
% 0.20/0.50 % Version : Biased.
% 0.20/0.50 % English :
% 0.20/0.50
% 0.20/0.50 % Refs :
% 0.20/0.50 % Source : [TPTP]
% 0.20/0.50 % Names :
% 0.20/0.50
% 0.20/0.50 % Status : Satisfiable
% 0.20/0.50 % Rating : 1.00 v5.5.0
% 0.20/0.50 % Syntax : Number of formulae : 63 ( 26 unt; 27 typ; 1 def)
% 0.20/0.50 % Number of atoms : 76 ( 9 equ; 3 cnn)
% 0.20/0.50 % Maximal formula atoms : 7 ( 2 avg)
% 0.20/0.50 % Number of connectives : 124 ( 3 ~; 9 |; 2 &; 105 @)
% 0.20/0.50 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.20/0.50 % ( 1 ~|; 2 ~&}
% 0.20/0.50 % Maximal formula depth : 9 ( 4 avg)
% 0.20/0.50 % Number of X terms : 19 ( 5 []; 6 ite; 8 let)
% 0.20/0.50 % Number arithmetic : 32 ( 7 atm; 0 fun; 13 num; 12 var)
% 0.20/0.50 % Number of types : 6 ( 1 usr; 3 ari)
% 0.20/0.50 % Number of type conns : 33 ( 30 >; 3 *; 0 +; 0 <<)
% 0.20/0.50 % Number of symbols : 54 ( 30 usr; 31 con; 0-4 aty)
% 0.20/0.50 % Number of variables : 27 ( 1 ^; 23 !; 1 ?; 27 :)
% 0.20/0.50 % ( 0 !>; 0 ?*; 1 @-; 1 @+)
% 0.20/0.50 % SPC : TH0_SAT_EQU_ARI
% 0.20/0.50
% 0.20/0.50 % Comments :
% 0.20/0.50 % Bugfixes : v4.0.1 - Fixed connective_terms and pi_sigma_operators so they're
% 0.20/0.50 % well typed.
% 0.20/0.50 % : v4.0.1 - Added more numbers, particularly rationals.
% 0.20/0.50 % : v4.1.1 - Removed rationals with negative denominators.
% 0.20/0.50 % : v4.1.1 - Fixed p_real_type
% 0.20/0.50 % : v5.5.0 - Fixed tff to thf in 4 formulae
% 0.20/0.50 % : v8.1.1 - Changed $ite to applications
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50 %----Quoted symbols
% 0.20/0.50 thf(distinct_object,axiom,
% 0.20/0.50 "An Apple" != "A \"Microsoft \\ escape\"" ).
% 0.20/0.50
% 0.20/0.50 %----Numbers
% 0.20/0.50 thf(p_int_type,type,
% 0.20/0.50 p_int: $int > $o ).
% 0.20/0.50
% 0.20/0.50 thf(p_rat_type,type,
% 0.20/0.50 p_rat: $rat > $o ).
% 0.20/0.50
% 0.20/0.50 thf(p_real_type,type,
% 0.20/0.50 p_real: $real > $o ).
% 0.20/0.50
% 0.20/0.50 thf(integers,axiom,
% 0.20/0.50 ( ( p_int @ 123 )
% 0.20/0.50 | ( p_int @ -123 ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(rationals,axiom,
% 0.20/0.50 ( ( p_rat @ 123/456 )
% 0.20/0.50 | ( p_rat @ -123/456 )
% 0.20/0.50 | ( p_rat @ 123/456 ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(reals,axiom,
% 0.20/0.50 ( ( p_real @ 123.456 )
% 0.20/0.50 | ( p_real @ -123.456 )
% 0.20/0.50 | ( p_real @ 123.456E78 )
% 0.20/0.50 | ( p_real @ 123.456e78 )
% 0.20/0.50 | ( p_real @ -123.456E78 )
% 0.20/0.50 | ( p_real @ 123.456E-78 )
% 0.20/0.50 | ( p_real @ -123.456E-78 ) ) ).
% 0.20/0.50
% 0.20/0.50 %----Types for stuff below
% 0.20/0.50 thf(a_type,type,
% 0.20/0.50 a: $i ).
% 0.20/0.50
% 0.20/0.50 thf(b_type,type,
% 0.20/0.50 b: $i ).
% 0.20/0.50
% 0.20/0.50 thf(f_type,type,
% 0.20/0.50 f: $i > $i ).
% 0.20/0.50
% 0.20/0.50 thf(g_type,type,
% 0.20/0.50 g: ( $i * $i ) > $i ).
% 0.20/0.50
% 0.20/0.50 thf(h_type,type,
% 0.20/0.50 h: ( $i * $i * $i ) > $i ).
% 0.20/0.50
% 0.20/0.50 thf(p_type,type,
% 0.20/0.50 p: $i > $o ).
% 0.20/0.50
% 0.20/0.50 thf(q_type,type,
% 0.20/0.50 q: $i > $i > $o ).
% 0.20/0.50
% 0.20/0.50 thf(tt_type,type,
% 0.20/0.50 tt: $tType ).
% 0.20/0.50
% 0.20/0.50 thf(dt_type,type,
% 0.20/0.50 dt:
% 0.20/0.50 [$i,tt,$int] ).
% 0.20/0.50
% 0.20/0.50 thf(pt_type,type,
% 0.20/0.50 pt: [tt,$i] > $o ).
% 0.20/0.50
% 0.20/0.50 thf(ft_type,type,
% 0.20/0.50 ft: $o > [$i,tt,$int] > [tt,$i] ).
% 0.20/0.50
% 0.20/0.50 thf(ptt_type,type,
% 0.20/0.50 ptt: [$int,$i,$o] > $o > $i > $o ).
% 0.20/0.50
% 0.20/0.50 %----Tuples
% 0.20/0.50 thf(tuples_1,axiom,
% 0.20/0.50 pt @ ( ft @ $true @ dt ) ).
% 0.20/0.50
% 0.20/0.50 thf(tuples_2,axiom,
% 0.20/0.50 ( p
% 0.20/0.50 = ( ^ [X: $i] : ( ptt @ [33,a,$true] @ ( q @ a @ b ) ) ) ) ).
% 0.20/0.50
% 0.20/0.50 %----Types for stuff below
% 0.20/0.50 thf(il_type,type,
% 0.20/0.50 il: $int ).
% 0.20/0.50
% 0.20/0.50 thf(jl_type,type,
% 0.20/0.50 jl: $int ).
% 0.20/0.50
% 0.20/0.50 thf(fl_type,type,
% 0.20/0.50 fl: $int > $int > $int > $int > $rat ).
% 0.20/0.50
% 0.20/0.50 thf(pl_type,type,
% 0.20/0.50 pl: $rat > $o ).
% 0.20/0.50
% 0.20/0.50 thf(ql_type,type,
% 0.20/0.50 ql: $int > $int > $o ).
% 0.20/0.50
% 0.20/0.50 thf(fll_type,type,
% 0.20/0.50 fll: $int > $int > $int > $int > $int ).
% 0.20/0.50
% 0.20/0.50 thf(pll_type,type,
% 0.20/0.50 pll: $int > $o ).
% 0.20/0.50
% 0.20/0.50 thf(max_type,type,
% 0.20/0.50 max: $int > $int > $int ).
% 0.20/0.50
% 0.20/0.50 thf(pc_type,type,
% 0.20/0.50 pc: [$int,$int] > $o ).
% 0.20/0.50
% 0.20/0.50 thf(dc_type,type,
% 0.20/0.50 dc:
% 0.20/0.50 [$int,$int] ).
% 0.20/0.50
% 0.20/0.50 %----Conditional constructs.
% 0.20/0.50 thf(ite_1,axiom,
% 0.20/0.50 ! [X: $int,Y: $int] : ( $ite @ ( $greater @ X @ Y ) @ ( pll @ X ) @ ( pll @ Y ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(ite_2,axiom,
% 0.20/0.50 ! [X: $int,Y: $int] : ( pll @ ( $ite @ ( $greater @ X @ Y ) @ X @ Y ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(max_defn,axiom,
% 0.20/0.50 ! [X: $int,Y: $int] :
% 0.20/0.50 ( ( max @ X @ Y )
% 0.20/0.50 = ( $ite @ ( $greatereq @ X @ Y ) @ X @ Y ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(max_property,axiom,
% 0.20/0.50 ! [X: $int,Y: $int] :
% 0.20/0.50 ( $ite
% 0.20/0.50 @ ( ( max @ X @ Y )
% 0.20/0.50 = X )
% 0.20/0.50 @ ( $greatereq @ X @ Y )
% 0.20/0.50 @ ( $greatereq @ Y @ X ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(ite_tuple_1,axiom,
% 0.20/0.50 ! [X: $int,Y: $int] : ( pc @ ( $ite @ ( $greater @ X @ Y ) @ [X,Y] @ [Y,X] ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(ite_tuple_2,axiom,
% 0.20/0.50 ! [X: $int,Y: $int] :
% 0.20/0.50 ( dc
% 0.20/0.50 = ( $ite @ ( $greater @ X @ Y ) @ [X,Y] @ [Y,X] ) ) ).
% 0.20/0.50
% 0.20/0.50 %----Let binders.
% 0.20/0.50 thf(let_1,axiom,
% 0.20/0.50 $let(
% 0.20/0.50 ff: $int > $int > $rat,
% 0.20/0.50 ff @ X @ Y:= fl @ X @ X @ Y @ Y,
% 0.20/0.50 pl @ ( ff @ il @ jl ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(let_2,axiom,
% 0.20/0.50 $let(
% 0.20/0.50 ff: $int > $int > $rat,
% 0.20/0.50 ff:= ^ [X: $int,Y: $int] : ( fl @ X @ X @ Y @ Y ),
% 0.20/0.50 pl @ ( ff @ il @ jl ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(let_tuple_1,axiom,
% 0.20/0.50 $let(
% 0.20/0.50 [ a: $int,
% 0.20/0.50 b: $int ],
% 0.20/0.50 [ a:= b,
% 0.20/0.50 b:= a ],
% 0.20/0.50 ql @ a @ b ) ).
% 0.20/0.50
% 0.20/0.50 thf(let_tuple_2,axiom,
% 0.20/0.50 $let(
% 0.20/0.50 [ ff: $int > $int > $int,
% 0.20/0.50 gg: $int > $int ],
% 0.20/0.50 [ ff @ X @ Y:= fll @ X @ X @ Y @ Y,
% 0.20/0.50 gg @ Z:= fll @ Z @ Z @ Z @ Z ],
% 0.20/0.50 pll @ ( ff @ il @ ( gg @ il ) ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(let_tuple_3,axiom,
% 0.20/0.50 $let(
% 0.20/0.50 ff: $int > $int > $int,
% 0.20/0.50 ff @ X @ Y:= fll @ X @ X @ Y @ Y,
% 0.20/0.50 $let(
% 0.20/0.50 gg: $int > $int,
% 0.20/0.50 gg @ Z:= ff @ Z @ Z,
% 0.20/0.50 pll @ ( gg @ il ) ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(let_tuple_4,axiom,
% 0.20/0.50 $let(
% 0.20/0.50 [ a: $int,
% 0.20/0.50 b: $int ],
% 0.20/0.50 [a,b]:=
% 0.20/0.50 [27,28],
% 0.20/0.50 qll @ a @ b ) ).
% 0.20/0.50
% 0.20/0.50 thf(let_tuple_5,axiom,
% 0.20/0.50 $let(
% 0.20/0.50 d:
% 0.20/0.50 [$int,$int],
% 0.20/0.50 d:=
% 0.20/0.50 [27,28],
% 0.20/0.50 pc @ d ) ).
% 0.20/0.50
% 0.20/0.50 %----Connective terms
% 0.20/0.50 thf(connective_terms,axiom,
% 0.20/0.50 ! [P: $o,C: $i] :
% 0.20/0.50 ( ( (&) @ ( p @ C ) @ P )
% 0.20/0.50 = ( (~) @ ( (~&) @ ( p @ C ) @ P ) ) ) ).
% 0.20/0.50
% 0.20/0.50 %----Connectives - seen |, &, =>, ~ already
% 0.20/0.50 thf(description_choice,axiom,
% 0.20/0.50 ( ? [X: $i] :
% 0.20/0.50 ( ( p @ X )
% 0.20/0.50 & ! [Y: $i] :
% 0.20/0.50 ( ( p @ Y )
% 0.20/0.50 => ( X = Y ) ) )
% 0.20/0.50 => ( ( @-[X: $i] : ( p @ X ) )
% 0.20/0.50 = ( @+[X: $i] : ( p @ X ) ) ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(never_used_connectives,axiom,
% 0.20/0.50 ! [X: $i] :
% 0.20/0.50 ( ( ( p @ X )
% 0.20/0.50 ~| ~ ( q @ X @ a ) )
% 0.20/0.50 ~& ( p @ X ) ) ).
% 0.20/0.50
% 0.20/0.50 %----Roles
% 0.20/0.50 thf(role_definition,definition,
% 0.20/0.50 ! [X: $i] :
% 0.20/0.50 ( ( f @ a )
% 0.20/0.50 = ( f @ X ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(role_assumption,assumption,
% 0.20/0.50 p @ a ).
% 0.20/0.50
% 0.20/0.50 thf(role_lemma,lemma,
% 0.20/0.50 p @ a ).
% 0.20/0.50
% 0.20/0.50 thf(role_theorem,theorem,
% 0.20/0.50 p @ a ).
% 0.20/0.50
% 0.20/0.50 thf(role_unknown,unknown,
% 0.20/0.50 p @ a ).
% 0.20/0.50
% 0.20/0.50 %----Selective include directive
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50 %----Some axioms to include
% 0.20/0.50 thf(ia1_type,type,
% 0.20/0.50 ia1: $o ).
% 0.20/0.50
% 0.20/0.50 thf(ia3_type,type,
% 0.20/0.50 ia3: $o ).
% 0.20/0.50
% 0.20/0.50 thf(ia1,axiom,
% 0.20/0.50 ia1 ).
% 0.20/0.50
% 0.20/0.50 thf(ia3,axiom,
% 0.20/0.50 ia3 ).
% 0.20/0.50
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50
% 0.20/0.50 %----Source
% 0.20/0.50 thf(source_unknown,axiom,
% 0.20/0.50 ! [X: $i] : ( p @ X ),
% 0.20/0.50 unknown ).
% 0.20/0.50
% 0.20/0.50 thf(source,axiom,
% 0.20/0.50 ! [X: $i] : ( p @ X ),
% 0.20/0.50 file('SYN000-1.p') ).
% 0.20/0.50
% 0.20/0.50 thf(source_name,axiom,
% 0.20/0.50 ! [X: $i] : ( p @ X ),
% 0.20/0.50 file('SYN000-1.p',source_unknown) ).
% 0.20/0.50
% 0.20/0.50 thf(source_copy,axiom,
% 0.20/0.50 ! [X: $i] : ( p @ X ),
% 0.20/0.50 source_unknown ).
% 0.20/0.50
% 0.20/0.50 thf(source_introduced_assumption,axiom,
% 0.20/0.50 ! [X: $i] : ( p @ X ),
% 0.20/0.50 introduced(assumption,[from,the,world]) ).
% 0.20/0.50
% 0.20/0.50 thf(source_inference,axiom,
% 0.20/0.50 p @ a,
% 0.20/0.50 inference(magic,[status(thm),assumptions([source_introduced_assumption])],[theory(equality),source_unknown]) ).
% 0.20/0.50
% 0.20/0.50 thf(source_inference_with_bind,axiom,
% 0.20/0.50 p @ a,
% 0.20/0.50 inference(magic,[status(thm)],[theory(equality),source_unknown:[bind(X,$fot(a))]]) ).
% 0.20/0.50
% 0.20/0.50 %----Useful info
% 0.20/0.50 thf(useful_info,axiom,
% 0.20/0.50 ! [X: $i] : ( p @ X ),
% 0.20/0.50 unknown,
% 0.20/0.50 [simple,prolog(like,Data,[nested,12.2]),AVariable,12.2,"A distinct object",$thf( ( p @ X ) | ~ ( q @ X @ a ) ),data(name):[colon,list,2],[simple,prolog(like,Data,[nested,12.2]),AVariable,12.2]] ).
% 0.20/0.50
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.APVM9o9mqm/cvc5---1.0.5_2253.p...
% 0.20/0.54 (declare-sort $$unsorted 0)
% 0.20/0.54 (declare-fun |"An Apple"| () $$unsorted)
% 0.20/0.54 (declare-fun |"A _"Microsoft __ escape_""| () $$unsorted)
% 0.20/0.54 (assert (not (= |"An Apple"| |"A _"Microsoft __ escape_""|)))
% 0.20/0.54 (declare-fun tptp.p_int (Int) Bool)
% 0.20/0.54 (declare-fun tptp.p_rat (Real) Bool)
% 0.20/0.54 (declare-fun tptp.p_real (Real) Bool)
% 0.20/0.54 (assert (or (@ tptp.p_int 123) (@ tptp.p_int (- 123))))
% 0.20/0.54 (assert (let ((_let_1 (@ tptp.p_rat (/ 41 152)))) (or _let_1 (@ tptp.p_rat (/ (- 41) 152)) _let_1)))
% 0.20/0.54 (assert (let ((_let_1 (@ tptp.p_real 123456000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (or (@ tptp.p_real (/ 15432 125)) (@ tptp.p_real (/ (- 15432) 125)) _let_1 _let_1 (@ tptp.p_real (- 123456000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (@ tptp.p_real (/ 1929 15625000000000000000000000000000000000000000000000000000000000000000000000000000)) (@ tptp.p_real (/ (- 1929) 15625000000000000000000000000000000000000000000000000000000000000000000000000000)))))
% 0.20/0.54 (declare-fun tptp.a () $$unsorted)
% 0.20/0.54 (declare-fun tptp.b () $$unsorted)
% 0.20/0.54 (declare-fun tptp.f ($$unsorted) $$unsorted)
% 0.20/0.54 (declare-fun tptp.g ((-> $$unsorted $$unsorted)) $$unsorted)
% 0.20/0.54 (declare-fun tptp.h ((-> $$unsorted $$unsorted $$unsorted)) $$unsorted)
% 0.20/0.54 (declare-fun tptp.p ($$unsorted) Bool)
% 0.20/0.54 (declare-fun tptp.q ($$unsorted $$unsorted) Bool)
% 0.20/0.54 (declare-sort tptp.tt 0)
% 0.20/0.54 (error "Parse Error: /export/starexec/sandbox/tmp/tmp.APVM9o9mqm/cvc5---1.0.5_2253.p:98.7: Unimplemented feature: Tuple types
% 0.20/0.54
% 0.20/0.54 [$i,tt,$int] ).
% 0.20/0.54 ^
% 0.20/0.54 ")
% 0.20/0.54 ------- get file name : TPTP file name is SYN000^2
% 0.20/0.54 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_2253.smt2...
% 0.20/0.54 --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.57 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 0.20/0.59 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 0.20/0.61 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 0.20/0.63 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 0.20/0.65 --- Run --no-ho-matching --full-saturate-quant --enum-inst-interleave --ho-elim-store-ax at 10...
% 0.20/0.66 --- Run --no-ho-matching --full-saturate-quant --macros-quant-mode=all at 10...
% 0.20/0.68 --- Run --ho-elim --full-saturate-quant --enum-inst-interleave at 10...
% 0.20/0.69 --- Run --no-ho-matching --full-saturate-quant --ho-elim-store-ax at 10...
% 0.20/0.70 --- Run --ho-elim --no-ho-elim-store-ax --full-saturate-quant...
% 0.20/0.72 % cvc5---1.0.5 exiting
% 0.20/0.72 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------